Defining Steady-State Service Level Agreeability using Semi-Markov Process

نویسندگان

  • Ranjith Vasireddy
  • Kishor S Trivedi
چکیده

The ability of the servers to deliver services to the clients according to pre-defined agreements is becoming an important requirement. These pre-defined agreements are sometimes referred to as service level agreements (SLA). In most practical cases, these agreements are based on the response times observed by the customer. This service level ‘agreeability’ is not captured in the definitions of availability. A guarantee of server’s five-nines availability does not imply any guarantees to its service level agreements. System might be available most of the time, but it might not be satisfying the service level agreements. Although there is lot of work on making the systems satisfy service level agreements, the notion of service-level agreeability is not mathematically defined. Such definition should be useful in practice to compare service level agreements between different systems. In this paper, we attempt to mathematically characterize measurement-based steadystate service level agreeability. This definition is on the assumption that service-level agreements are based on response times. This assumption should be valid in practice, because ultimately all pre-defined agreements should result in the improved response-times observed by the customers of the system. Our characterization of service level agreeability is very much similar to the definition of steady-state availability [1]. System at any given point of time can be in one state of a set of possible states (S1, .. , SN ). In our definition, the set of possible states are divided based on threshold responsetime into two mutually exclusive sets SLA Satisfying States and SLA Violating States. We define the instantaneous service level agreeability SLA(t) of a system as the probability that the system is in one of the SLA satisfying states at time t. Often we are interested in the state of the system after a sufficiently long time has elapsed. For this purpose, we define the steady-state service level agreeability (or simply

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Availability analysis of mechanical systems with condition-based maintenance using semi-Markov and evaluation of optimal condition monitoring interval

Maintenance helps to extend equipment life by improving its condition and avoiding catastrophic failures. Appropriate model or mechanism is, thus, needed to quantify system availability vis-a-vis a given maintenance strategy, which will assist in decision-making for optimal utilization of maintenance resources. This paper deals with semi-Markov process (SMP) modeling for steady state availabili...

متن کامل

ANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS

This paper presents the analysis of a renewal input  finite buffer queue wherein the customers can decide either to  join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed  by an underlying $m$-state Markov chain. Employing the supplementary  variable and imbedded Markov chain techniques,   the steady-state system length distributions at pre...

متن کامل

Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation

This paper describes an analytical study of open two-node (tandem) network models with blocking and truncation. The study is based on semi-Markov process theory, and network models assume that multiple servers serve each queue. Tasks arrive at the tandem in a Poisson fashion at the rate λ, and the service times at the first and the second node are nonexponentially distributed with means s and s...

متن کامل

Performance queries on semi-Markov stochastic Petri nets with an extended continuous stochastic logic

Semi-Markov Stochastic Petri Nets (SM-SPNs) are a highlevel formalism for defining semi-Markov processes. We present an extended Continuous Stochastic Logic (eCSL) which provides an expressive way to articulate performance queries at the SM-SPN model level. eCSL supports queries involving steady-state, transient and passage time measures. We demonstrate this by formulating and answering eCSL qu...

متن کامل

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006